Nakajima’s Problem for General Convex Bodies
نویسنده
چکیده
For a convex body K ⊂ Rn, the kth projection function of K assigns to any k-dimensional linear subspace of Rn the k-volume of the orthogonal projection of K to that subspace. Let K and K0 be convex bodies in Rn, let K0 be centrally symmetric and satisfy a weak regularity assumption. Let i, j ∈ N be such that 1 ≤ i < j ≤ n − 2 with (i, j) 6= (1, n−2). Assume that K and K0 have proportional ith projection functions and proportional jth projection functions. Then we show thatK andK0 are homothetic. In the particular case where K0 is a Euclidean ball, we thus obtain characterizations of Euclidean balls as convex bodies having constant i-brightness and constant j-brightness. This special case solves Nakajima’s problem in arbitrary dimensions and for general convex bodies for most indices (i, j).
منابع مشابه
Nakajima’s Problem: Convex Bodies of Constant Width and Constant Brightness
For a convex body K ⊂ Rn, the kth projection function of K assigns to any k-dimensional linear subspace of Rn the k-volume of the orthogonal projection of K to that subspace. Let K and K0 be convex bodies in Rn, and let K0 be centrally symmetric and satisfy a weak regularity and curvature condition (which includes all K0 with ∂K0 of class C2 with positive radii of curvature). Assume that K and ...
متن کاملConvex Bodies of Constant Width and Constant Brightness
Under the extra assumption that the boundary is of class C this was proven by S. Nakajima (= A. Matsumura) in 1926 Theorem 1 solves this problem. For convex bodies with C boundaries and positive curvature Nakajima’s result was generalized by Chakerian [?] in 1967 to “relative geometry” where the width and brightness are measured with with respect to some convex body K0 symmetric about the origi...
متن کاملSmooth Convex Bodies with Proportional Projection Functions
For a convex body K ⊂ Rn and i ∈ {1, . . . , n− 1}, the function assigning to any i-dimensional subspace L of Rn, the i-dimensional volume of the orthogonal projection of K to L, is called the i-th projection function of K. Let K, K0 ⊂ Rn be smooth convex bodies of class C2 +, and let K0 be centrally symmetric. Excluding two exceptional cases, we prove that K and K0 are homothetic if they have ...
متن کاملA bi-level linear programming problem for computing the nadir point in MOLP
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
متن کاملThe KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings
The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007